Path-Wise Test Data Generation Based on Heuristic Look-Ahead Methods
نویسندگان
چکیده
منابع مشابه
Performance Analysis of Test Data Generation for Path Coverage Based Testing Using Three Meta- Heuristic Algorithms
This paper discusses an approach to generate test data for path coverage based testing using Genetic Algorithms, Differential Evolution and Artificial Bee Colony optimization algorithms. Control flow graph and cyclomatic complexity of the example program has been used to find out the number of feasible paths present in the program and it is compared with the actual no of paths covered by the ev...
متن کاملTest Data Generation Based on Test Path Discovery Using Intelligent Water Drop
Automatic test data generation is required to generate test cases dynamically for a specific software program. Manual generation of test data is too tedious and a time consuming task. This paper proposes a technique using Intelligent Water Drop (IWD) for automatic generation of test data. Correctly generated test data helps in reducing the effort while testing the software. This paper discusses...
متن کاملLook-Ahead Based SAT Solvers
Imagine that you are for the first time in New York City (NYC). A cab just dropped you off at a crossing and now you want to see the most beautiful part of town. You consider two potential strategies to get going: A conflict-driven strategy and a look-ahead strategy. The conflict-driven strategy consists of the following heuristics: On each crossing you look in all directions and walk towards t...
متن کاملA Conflict-Based Path-Generation Heuristic for Evacuation Planning
5 Evacuation planning and scheduling is a critical aspect of disaster management and national security applications. This paper proposes a conflict-based path-generation approach for evacuation planning. Its key idea is to decompose the evacuation planning problem into a master and a subproblem. The subproblem generates new evacuation paths for each evacuated area, while the master problem opti...
متن کاملLook-Ahead Procedures for Lanczos-Type Product Methods Based on Three-Term Lanczos Recurrences
Lanczos-type product methods for solving large sparse non-Hermitian linear systems have as residual polynomials either the squares of the Lanczos polynomials or the products of the latter with another sequence of polynomials, which is normally chosen to enforce some local minimization of the residual norm. In either case, these methods inherit from the underlying Lanczos process the danger of b...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Problems in Engineering
سال: 2014
ISSN: 1024-123X,1563-5147
DOI: 10.1155/2014/642630